Poster: Zero-Knowledge Authenticated Order Queries and Applications

Releasing verifiable partial information while maintaining privacy of the rest of the data is a requirement in many practical scenarios. In particular, maintaining an ordered list of elements in a trustworthy and privacy-preserving manner has a number of applications in management of network information and health care data. In this poster, we discuss our efficient, fully dynamic, secure and privacy-preserving mechanisms that allow querying of member and order information on the data stored in lists, trees, or posets of bounded dimension. I. DYNAMIC PRIVACY-PRESERVING AUTHENTICATED DATA STRUCTURE MODEL Motivated by networking and cloud computing applications, we introduce a formal model of a dynamic privacy-preserving authenticated data structure (DPPADS). It is a three party model where the owner outsources his data structure to a server who answers queries issued by a set of distributed clients. The owner can at any point update the data structure. The server answers queries in such a way that the clients (1) can verify the correctness of the answers but (2) do not learn anything about the data structure besides what can be inferred from the query answers. This poster is based on [1] (to appear in ACNS 2015) and [2].